#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node{ 
	int data; 
	struct node *next; 
}node_t, *Linklist;
Linklist list_Create();
int list_whereinsert(Linklist H, int value, int pos);

Linklist list_Create()
{
    Linklist head=(Linklist)malloc(sizeof(node_t));
    if(head==NULL)
    {
        printf("malloc faild\n");
        return NULL;
    }
    memset(&head->data,0,sizeof(int));
    head->next=NULL;
    return head;
}
int list_whereinsert(Linklist H, int value, int pos)
{
    if (H==NULL||pos<0)
    {
        printf("�б������ڻ�λ�ô���\n");
        return -1;
    }
    Linklist phead=H->next;
    if (phead==NULL)
    {
        printf("�б�������\n");
        return -1;
    }
    for (int i = 0; i < pos-1; i++)
    {
        phead=phead->next;
    }
    Linklist newnode=(Linklist)malloc(sizeof(node_t));
    newnode->next=phead->next;
    phead->next=newnode;
    memcpy(&newnode->data,&value,sizeof(int));
    return 0;
}